D-complete Sequences of Integers
نویسندگان
چکیده
An infinite sequence a1 < a2 < · · · is d-complete if every sufficiently large integer is the sum of ai such that no one divides the other. We investigate d-completeness of sets of the form {pαqβ} and {pαqβrγ} with α, β, γ nonnegative.
منابع مشابه
Non-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملInterspersions and Fractal Sequences Associated with Fractions c/d
Suppose c ≥ 2 and d ≥ 2 are integers, and let S be the set of integers ⌊ c/d ⌋ , where j and k range over the nonnegative integers. Assume that c and d are multiplicatively independent; that is, if p and q are integers for which c = d, then p = q = 0. The numbers in S form interspersions in various ways. Related fractal sequences and permutations of the set of nonnegative integers are also disc...
متن کاملComplete sequences of sets of integer powers
Call S complete if Σ(S) contains all sufficiently large integers. It has been known for some time (see [B]) that if gcd(a, b) = 1 then the (nondecreasing) sequence formed from the values ab with s0 ≤ s, t0 ≤ t ≤ f(s0, t0) is complete, where s0 and t0 are arbitrary, and f(s0, t0) is sufficiently large. In this note we consider the analogous question for sequences formed from pure powers of integ...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملr-COMPLETENESS OF SEQUENCES OF POSITIVE INTEGERS
A complete sequence (an) is a strictly increasing sequence of positive integers such that every su ciently large positive integer is representable as the sum of one or more distinct terms from (an). In this paper, we consider the more general notion of an r-complete sequence where every su ciently large positive integer is now representable as the sum of r or more distinct terms from (an). In p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 1996